Перевод: со всех языков на все языки

со всех языков на все языки

planar covering

См. также в других словарях:

  • Covering problem of Rado — The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado. Formulation …   Wikipedia

  • Planar process — The planar process is a manufacturing process used in the semiconductor industry to build individual components of a transistor, and in turn, connect those transistors together. It is the primary process by which modern integrated circuits are… …   Wikipedia

  • Lebesgue covering dimension — or topological dimension is one of several inequivalent notions of assigning a topological invariant dimension to a given topological space. Contents 1 Definition 2 Examples 3 Properties 4 …   Wikipedia

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane …   Wikipedia

  • Ambisonics — is a series of recording and replay techniques using multichannel mixing technology that can be used live or in the studio. By encoding and decoding sound information on a number of channels, a 2 dimensional ( planar , or horizontal only) or 3… …   Wikipedia

  • Latin American architecture — Introduction       history of architecture in Mesoamerica, Central America, South America, and the Caribbean beginning after contact with the Spanish and Portuguese in 1492 and 1500, respectively, and continuing to the present.       For… …   Universalium

  • Rotation matrix — In linear algebra, a rotation matrix is a matrix that is used to perform a rotation in Euclidean space. For example the matrix rotates points in the xy Cartesian plane counterclockwise through an angle θ about the origin of the Cartesian… …   Wikipedia

  • List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …   Wikipedia

  • Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… …   Wikipedia

  • Glossary of botanical terms — Many of the terms used in Wikipedia glossaries (often most) are already defined and explained within Wikipedia itself. However, lists like the following indicate where new articles need to be written and are also useful for looking up and… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»